A Simple Linear Time Split Decomposition Algorithm of Undirected Graphs
نویسندگان
چکیده
We revisit the problem of designing a linear time algorithm for undirected graph split decomposition. Although that this problem has already been claimed to be solved in [E. Dahlhaus, FSTTCS, 1994] and [E. Dahlhaus, Journal of Algorithms 36(2):205-240, 2000], we present a new well founded theoretical background for split decomposition that allow us to clearly design and proove the rst simple linear time split decomposition algorithm.
منابع مشابه
Linear Time Split Decomposition Revisited
Given a family F of subsets of a ground set V , its orthogonal is de ned to be the family of subsets that do not overlap any element of F . Using this tool we revisit the problem of designing a simple linear time algorithm for undirected graph split (also known as 1-join) decomposition.
متن کاملComputing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time
In this paper, we design an algorithm that, given a directed graph G and the Cartesian-product decomposition of its underlying undirected graph G̃, produces the directed Cartesian-product decomposition of G in linear time. This is the first time that the linear complexity is achieved for this problem, which has two major consequences. Firstly, it shows that the directed and undirected versions o...
متن کاملSimple, linear-time modular decomposition
Modular decomposition is fundamental for many important problems in algorithmic graph theory including transitive orientation, the recognition of several classes of graphs, and certain combinatorial optimization problems. Accordingly, there has been a drive towards a practical, linear-time algorithm for the problem. Despite considerable effort, such an algorithm has remained elusive. The linear...
متن کاملLinear-time modular decomposition of directed graphs
Modular decomposition of graphs is a powerful tool with many applications in graph theory and optimization. There are e cient linear-time algorithms that compute the decomposition for undirected graphs. The best previously published time bound for directed graphs is O(n+m log n), where n is the number of vertices and m is the number of edges. We give an O(n + m)-time algorithm.
متن کاملA Linear-Time Algorithm for Computing the Prime Decomposition of a Directed Graph with Regard to the Cartesian Product
In this paper, we design the first linear-time algorithm for computing the prime decomposition of a digraph G with regard to the cartesian product. A remarkable feature of our solution is that it computes the decomposition of G from the decomposition of its underlying undirected graph, for which there exists a linear-time algorithm. First, this allows our algorithm to remain conceptually very s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0902.1700 شماره
صفحات -
تاریخ انتشار 2009